Universal pairs of regressive isols.
نویسندگان
چکیده
منابع مشابه
Regressive functions on pairs
We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...
متن کاملRecursive Fibers of Rst Isols
Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. Math. 12 (1986), 163-175), we study such fibers in the more general context of Nerode semirings. The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Ner...
متن کاملNonrecursive Relations among the Isols
The universal isol metatheorem is extended so as to deal with nonrecursive relations and countable Boolean operations.
متن کاملHereditarily Odd–even and Combinatorial Isols
In this paper we study some of the arithmetic structure that is found in a special kind of semi-ring in the isols. These are the semi-rings [D(Y ),+, ·] that were introduced by J.C.E. Dekker, and that were later shown by E. Ellentuck to model the true universal recursive statements of arithmetic when Y is a regressive isol and is hyper-torre (= hereditarily odd-even = HOE). When Y is regressive...
متن کاملRegressive Analysis ∗
The regressive analytical method which can be generally understood as the way backward occurs in science on different levels. In scientific practice it represent research, i. e., activities of scientists when looking for the conditions necessary to solve given problems. On the methodological level it stands for ordering a given set of statements, and, finally, on the foundational level it gives...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1975
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891805